package aer.KBitsA1;

import java.math.BigInteger;

public class Rellenar {

	public static void main(String[] args) {
		String[] a = new String[1001];

		for (int i = 0; i <= 100; i++) {
			a[i] = factorial(i).toString();
		}

		for (int i = 0; i < 100; i++) {
			System.out.println(i+" "+a[i]);
		}
		

	}

	private static BigInteger factorial(int n) {
		if (n <= 1) {
			return (new BigInteger("1"));
		} else {
			BigInteger fac = new BigInteger(String.valueOf(n));
			return (fac.multiply(factorial(n - 1)));
		}
	}

}
